finite set - определение. Что такое finite set
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое finite set - определение

Найдено результатов: 2085
Finite set         
SET THAT HAS A FINITE NUMBER OF ELEMENTS
K-subsets; N-set; Finite Set; K-subset; Finitely many; N-subset; Finite sets; Kuratowski-finite; Kuratowski finiteness; Kuratowski finite; Two-set; Tarski-finite set; Kuratowski-finite set; Tarski finiteness
In mathematics, particularly set theory, a finite set is a set that has a [number of element]s. Informally, a finite set is a set which one could in principle count and finish counting.
Hereditarily finite set         
  • link=http://upload.wikimedia.org/wikipedia/commons/thumb/1/1b/Nested_set_V4.svg/1600px-Nested_set_V4.svg.png
FINITE SETS WHOSE ELEMENTS ARE ALL HEREDITARILY FINITE SETS
Hereditarily finite; Hereditarily finite sets; Pure finite set; Ackermann coding; Ackermann encoding
In mathematics and set theory, hereditarily finite sets are defined as finite sets whose elements are all hereditarily finite sets. In other words, the set itself is finite, and all of its elements are finite sets, recursively all the way down to the empty set.
Dedekind-infinite set         
PROPER SUBSET B OF A THAT IS EQUINUMEROUS TO A
Dedekind infinite; Dedekind-infinite; Dedekind finite; Dedekind finite set; Dedekind-finite set; Dedekind-finite; Dedekind infinity; Directly finite ring; Dedekind finite ring; Didekind infinite
In mathematics, a set A is Dedekind-infinite (named after the German mathematician Richard Dedekind) if some proper subset B of A is equinumerous to A. Explicitly, this means that there exists a bijective function from A onto some proper subset B of A.
Caccioppoli set         
SET WHOSE BOUNDARY IS MEASURABLE AND HAS (AT LEAST LOCALLY) A FINITE MEASURE
Set of finite perimeter
In mathematics, a Caccioppoli set is a set whose boundary is measurable and has (at least locally) a finite measure. A synonym is set of (locally) finite perimeter.
Set (mathematics)         
  • The [[natural numbers]] <math>\mathbb{N}</math> are contained in the [[integers]] <math>\mathbb{Z}</math>, which are contained in the [[rational numbers]] <math>\mathbb{Q}</math>, which are contained in the [[real numbers]] <math>\mathbb{R}</math>, which are contained in the [[complex numbers]] <math>\mathbb{C}</math>
  • Passage with a translation of the original set definition of Georg Cantor. The German word ''Menge'' for ''set'' is translated with ''aggregate'' here.
  • ''A'' ∩ ''B''}}</div>
  • ''A'' \ ''B''}}</div>
  • <div class="center">The '''symmetric difference''' of ''A'' and ''B''</div>
  • ''A'' ∪ ''B''}}</div>
  • <div class="center">The '''complement''' of ''A'' in ''U''</div>
  • ''A'' is a subset of ''B''.<br>''B'' is a superset of ''A''.
WELL-DEFINED MATHEMATICAL COLLECTION OF DISTINCT OBJECTS
Set (math); Crisp set; Conventional set; Number sets; Set (mathematical); Mathematical set; Set logic; Basic set operations; Finite subset
A set is the mathematical model for a collection of different things; a set contains elements or members, which can be mathematical objects of any kind: numbers, symbols, points in space, lines, other geometrical shapes, variables, or even other sets. The set with no element is the empty set; a set with a single element is a singleton.
Finite morphism         
In algebraic geometry, a finite morphism between two affine varieties X, Y is a dense regular map which induces isomorphic inclusion k\left[Y\right]\hookrightarrow k\left[X\right] between their coordinate rings, such that k\left[X\right] is integral over k\left[Y\right]. This definition can be extended to the quasi-projective varieties, such that a regular map f\colon X\to Y between quasiprojective varieties is finite if any point like y\in Y has an affine neighbourhood V such that U=f^{-1}(V) is affine and f\colon U\to V is a finite map (in view of the previous definition, because it is between affine varieties).
Finite element method         
  • A function in <math>H_0^1,</math> with zero values at the endpoints (blue), and a piecewise linear approximation (red)
  • (c) The computed solution, <math>u(x, y)=1-x^2-y^2.</math>
  • (b) The [[sparse matrix]] ''L'' of the discretized linear system
  • Solving the two-dimensional problem <math>u_{xx}+u_{yy}=-4</math> in the disk centered at the origin and radius 1, with zero boundary conditions.<br />(a) The triangulation.
  • url=https://ris.utwente.nl/ws/files/6153316/CMBBE2014-Hamid-Submitted.pdf}}</ref>
  • A piecewise linear function in two dimensions
  • alt=
  • alt=
NUMERICAL METHOD FOR SOLVING PHYSICAL OR ENGINEERING PROBLEMS
Finite element analysis; Finite Element Analysis; Finite elements; Finite element; Finite Element Method; Engineering treatment of the finite element method; Finite element solver; Finite element meshing; Finite element problem; Engineering treatment of the Finite Element Method; Finite element methods; Finite difference method based on variation principle; Finite elements analysis; Finite-element method; Finite-element analysis; Finite-element methods; Nonlinear finite element analysis
The finite element method (FEM) is a popular method for numerically solving differential equations arising in engineering and mathematical modeling. Typical problem areas of interest include the traditional fields of structural analysis, heat transfer, fluid flow, mass transport, and electromagnetic potential.
Finite Automaton         
  • TTL]] counter, a type of state machine
  • Fig. 5: Representation of an acceptor; this example shows one that determines whether a binary number has an even number of 0s, where ''S''<sub>1</sub> is an ''accepting state'' and ''S''<sub>2</sub> is a ''non accepting state''.
  • Fig. 3 Example of a simple finite-state machine
  • Fig. 6 Transducer FSM: Moore model example
  • Fig. 7 Transducer FSM: Mealy model example
  • Fig. 4: Acceptor FSM: parsing the string "nice".
  • Fig. 2 SDL state machine example
  • A turnstile
  • State diagram for a turnstile
  • Fig. 1 UML state chart example (a toaster oven)
MATHEMATICAL MODEL OF COMPUTATION; ABSTRACT MACHINE THAT CAN BE IN EXACTLY ONE OF A FINITE NUMBER OF STATES AT ANY GIVEN TIME
Finite state machines; Finite state automaton; Finite automaton; Finite state automata; Start state; Finite automata; Deterministic automata; State machine; SFSM; Finite State Machine; Finate state automata; Accept state; Accepting state; State Machine; State machines; Recognizer; Recognizers; Sequence detector; Sequence detectors; Finite state acceptor; Finite State Automaton; State transition function; Finite State Machines; Finite-state automata; Finite-state automaton; Finite state machine; Finite state grammar; Finite-state machines; Finite state-machine; Finite state language; Finite state; Finite Automata; Finite state recognizer; Finite-state recognizer; State-machine; Acceptor (finite-state machine); Optimization of finite state machines; Recogniser
Finite volume method         
METHOD FOR REPRESENTING AND EVALUATING PARTIAL DIFFERENTIAL EQUATIONS
Finite volume; Finite-volume method
The finite volume method (FVM) is a method for representing and evaluating partial differential equations in the form of algebraic equations.
Finite State Automata         
  • TTL]] counter, a type of state machine
  • Fig. 5: Representation of an acceptor; this example shows one that determines whether a binary number has an even number of 0s, where ''S''<sub>1</sub> is an ''accepting state'' and ''S''<sub>2</sub> is a ''non accepting state''.
  • Fig. 3 Example of a simple finite-state machine
  • Fig. 6 Transducer FSM: Moore model example
  • Fig. 7 Transducer FSM: Mealy model example
  • Fig. 4: Acceptor FSM: parsing the string "nice".
  • Fig. 2 SDL state machine example
  • A turnstile
  • State diagram for a turnstile
  • Fig. 1 UML state chart example (a toaster oven)
MATHEMATICAL MODEL OF COMPUTATION; ABSTRACT MACHINE THAT CAN BE IN EXACTLY ONE OF A FINITE NUMBER OF STATES AT ANY GIVEN TIME
Finite state machines; Finite state automaton; Finite automaton; Finite state automata; Start state; Finite automata; Deterministic automata; State machine; SFSM; Finite State Machine; Finate state automata; Accept state; Accepting state; State Machine; State machines; Recognizer; Recognizers; Sequence detector; Sequence detectors; Finite state acceptor; Finite State Automaton; State transition function; Finite State Machines; Finite-state automata; Finite-state automaton; Finite state machine; Finite state grammar; Finite-state machines; Finite state-machine; Finite state language; Finite state; Finite Automata; Finite state recognizer; Finite-state recognizer; State-machine; Acceptor (finite-state machine); Optimization of finite state machines; Recogniser